TIGHT-TARDY PROGRESSIVE IDLING-FREE 1-MACHINE PREEMPTIVE SCHEDULING BY HEURISTIC’S EFFICIENT JOB ORDER INPUT
نویسندگان
چکیده
منابع مشابه
Improved heuristics for the single machine scheduling problem with linear early and quadratic tardy penalties
This paper considers the single machine scheduling problem with linear earliness and quadratic tardiness costs. The research on the version with inserted idle time focused on an exact approach, while several heuristics had already been proposed for the version with no idle time. These heuristics were then the basis for the development of new heuristic procedures for the version with idle time. ...
متن کاملHeuristics for the Early/tardy Scheduling Problem with Release Dates
In this paper we consider the single machine earliness/tardiness scheduling problem with different release dates and no unforced idle time. We analyse the performance of several dispatch rules, a greedy procedure and a decision theory local search heuristic. The dispatch rules use a lookahead parameter whose value must be specified. We perform some experiments to determine an appropriate value ...
متن کاملPreemptive Job-Shop Scheduling Using Stopwatch Automata
In this paper we show how the problem of job-shop scheduling where the jobs are preemptible can be modeled naturally as a shortest path problem defined on an extension of timed automata, namely stopwatch automata where some of the clocks might be freezed at certain states. Although general verification problems on stopwatch automata are known to be undecidable, we show that due to particular pr...
متن کاملPreemptive Job Scheduling in Star Graph Networks
In this paper we develop a feasibility algorithm for preemptively scheduling a given set of jobs with dimension and time requirements on a star graph network of given size with a given deadline. We show that the algorithm runs in O(n log n) time where n is the number of jobs.
متن کاملOn Job Fairness in Non-Preemptive Parallel Job Scheduling
Fairness is an important issue for parallel job scheduling policies, but has been ignored in most of previous studies. In this paper, we consider two different styles of job fairness: FCFS and EQ. Commonly used summary statistics are applied to different job measures to evaluate the fairness under a wide range of non-preemptive parallel job scheduling policies, including priority backfill polic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: KPI Science News
سال: 2020
ISSN: 2617-5509
DOI: 10.20535/kpi-sn.2020.3.199850